Automated Decomposition of Game Maps

نویسندگان

  • Kári Halldórsson
  • Yngvi Björnsson
چکیده

Video game worlds are getting increasingly large and complex. This poses challenges to the game AI for both pathfinding and strategic decisions, not least in realtime strategy games. One way to alleviate the problem is to manually pre-label the game maps with information about regions and critical choke points, which the game AI can then take advantage of. We present a method for automatically decomposing game maps into non-uniform sized regions. The method uses a flooding algorithm at its core and has the benefit, in addition to its effectiveness, to be relatively intuitive both conceptually and in implementing. Empirical evaluation on game maps shows that the automatic decomposition results in intuitive regions of a comparable standard to human-made labeling. Furthermore, we show that our automatic decomposition, when used by a pathfinding algorithm capable of taking advantage of pre-labeled regions, significantly improves search effectiveness.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A service decomposition and definition model in cloud manufacturing systems using game theory focusing on cost accounting perspectives

Cloud manufacturing is a new paradigm which has been under study since 2010 and a vast body of research has been conducted on this topic. Among them, service composition problems are of utmost importance. However, most studies only focused on private clouds meaning the objective function is defined for just one component of the supply chain. This paper attempts to consider service composition p...

متن کامل

Decomposition of Multi-player Games

Research in General Game Playing aims at building systems that learn to play unknown games without human intervention. We contribute to this endeavour by generalising the established technique of decomposition from AI Planning to multi-player games. To this end, we present a method for the automatic decomposition of previously unknown games into independent subgames, and we show how a general g...

متن کامل

Any-Angle Path Planning for Computer Games

Path planning is a critical part of modern computer games; rare is the game where nothing moves and path planning is not necessary. A* is the workhorse for most path planning applications. Block A* is a state-of-the-art algorithm that is always faster than A* in experiments using game maps. Unlike other methods that improve upon A*’s performance, Block A* does not require knowledge of the map b...

متن کامل

Automated terrain analysis in real-time strategy games

Real-time strategy (RTS) games represent a mainstream genre of video games. They are also practical test-beds for intelligent agents, which have received considerable interest from Artificial Intelligence (AI) researchers, in particular game AI researchers. Terrain knowledge understanding is a fundamental issue for RTS agents and map decomposition methods can help AI agents in representing terr...

متن کامل

A Risk-averse Inventory-based Supply Chain Protection Problem with Adapted Stochastic Measures under Intentional Facility Disruptions: Decomposition and Hybrid Algorithms

Owing to rising intentional events, supply chain disruptions have been considered by setting up a game between two players, namely, a designer and an interdictor contesting on minimizing and maximizing total cost, respectively. The previous studies have found the equilibrium solution by taking transportation, penalty and restoration cost into account. To contribute further, we examine how incor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015